منابع مشابه
Forbidden Factors and Fragment Assembly
In this paper methods and results related to the notion of minimal forbidden words are applied to the fragment assembly problem. The fragment assembly problem can be formulated, in its simplest form, as follows: reconstruct a word w from a given set I of substrings (fragments) of a word w. We introduce an hypothesis involving the set of fragments I and the maximal length m(w) of the minimal for...
متن کاملFragment Assembly through Minimal Forbidden Words
We give a linear-time algorithm to reconstruct a finite word w over a finite alphabet A of constant size starting from a finite set of factors of w verifying a suitable hypothesis. We use combinatorics techniques based on the minimal forbidden words, which have been introduced in previous papers. This improves a previous algorithm which worked under the assumption of stronger hypothesis.
متن کاملWords and forbidden factors
Given a *nite or in*nite word v, we consider the set M (v) of minimal forbidden factors of v. We show that the set M (v) is of fundamental importance in determining the structure of the word v. In the case of a *nite word w we consider two parameters that are related to the size of M (w): the *rst counts the minimal forbidden factors of w and the second gives the length of the longest minimal f...
متن کاملClosure and forbidden pairs for 2-factors
Pairs of connected graphs X,Y such that a graph G being 2-connected and XY free implies G is hamiltonian were characterized by Bedrossian. Using the closure concept for claw-free graphs, the first author simplified the characterization by showing that if considering the closure of G, the list in the Bedrossian’s characterization can be reduced to one pair, namely, K1,3, N1,1,1 (where Ki,j is th...
متن کاملConstraint based protein fragment assembly
We present a tool that predicts the 3D conformation of a protein, based on Constraint Logic Programming and fragment assembly. The fragments are derived from a database of known protein structures with a preprocessor —also developed for this work— that clusters and classifies the fragments according to their similarity and frequency. The fragments are used as building blocks by the CLP program ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 2001
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita:2001132